#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N=2e5+3;
int n,a[N],l=1;
int main()
{
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++)
		if(a[i]>a[l]) l++;
	printf("%d",n-l+1);
	return 0;
}
